Recurrence and Transience

ثبت نشده
چکیده

We have the following dichotomy result. Theorem 2. The following are equivalent: (1) X is transient; (2) X is not recurrent; (3) U0(B(0 � �)) < ∞ for all � > 0. Theorem 2 has the following important dichotomous implication: Either X is transient, or X is recurrent [and not both]. The proof relies on a convenient series of equivalences. Proposition 3. The following are equivalent: (1) sup�∈R� U0(B(� � �)) < ∞ for all � > 0; (2) U0(B(0 � �)) < ∞ for all � > 0; (3) U0(B(0 � �)) < ∞ for some � > 0; (4) �∞ 0 1lB(0��)(X�) d� < ∞ a.s. for all � > 0; (5) lim�↑∞ sup�∈B(0�2�) P{ �∞ 0 1lB(���)(X�) d� > �} < 1 for all � > 0.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recurrence/transience criteria for skew product diffusion processes

We give recurrence/transience criteria for skew products of one dimensional diffusion process and the spherical Brownian motion with respect to a positive continuous additive functional of the former one dimensional diffusion process. Further we give recurrence/ transience criteria for their time changed processes.

متن کامل

Recurrence for Branching Markov Chains

The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak recurrence and give several new conditions for weak recurrence and strong recurrence. These conditions make a unified treatment of known and new examples possi...

متن کامل

Walking within growing domains: recurrence versus transience*

For normally reflected Brownian motion and for simple random walk on independently growing in time d-dimensional domains, d ≥ 3, we establish a sharp criterion for recurrence versus transience in terms of the growth rate.

متن کامل

Monotone interaction of walk and graph: recurrence versus transience*

We consider recurrence versus transience for models of random walks on growing in time, connected subsets Gt of some fixed locally finite, connected graph, in which monotone interaction enforces such growth as a result of visits by the walk (or probes it sent), to the neighborhood of the boundary of Gt.

متن کامل

Spectral Gap and Transience for Ruelle Operators on Countable Markov Shifts

We find a necessary and sufficient condition for the Ruelle operator of a weakly Hölder continuous potential on a topologically mixing countable Markov shift to act with spectral gap on some rich Banach space. We show that the set of potentials satisfying this condition is open and dense for a variety of topologies. We then analyze the complement of this set (in a finer topology) and show that ...

متن کامل

Recurrence and transience properties of some neural networks: an approach via fluid limit models

The subject of the paper is the stability analysis of some neural networks consisting of a nite number of interacting neurons. Based on the uid limit model of the network we derive a suucient condition for positive Harris-recurrence of the associated Markov process. We further show that this condition is also necessary and derive in addition an alternative condition suucient for transience. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011